3 research outputs found
Clustering of solutions in the random satisfiability problem
Using elementary rigorous methods we prove the existence of a clustered phase
in the random -SAT problem, for . In this phase the solutions are
grouped into clusters which are far away from each other. The results are in
agreement with previous predictions of the cavity method and give a rigorous
confirmation to one of its main building blocks. It can be generalized to other
systems of both physical and computational interest.Comment: 4 pages, 1 figur
Geometrical organization of solutions to random linear Boolean equations
The random XORSAT problem deals with large random linear systems of Boolean
variables. The difficulty of such problems is controlled by the ratio of number
of equations to number of variables. It is known that in some range of values
of this parameter, the space of solutions breaks into many disconnected
clusters. Here we study precisely the corresponding geometrical organization.
In particular, the distribution of distances between these clusters is computed
by the cavity method. This allows to study the `x-satisfiability' threshold,
the critical density of equations where there exist two solutions at a given
distance.Comment: 20 page
Clusters of solutions and replica symmetry breaking in random k-satisfiability
We study the set of solutions of random k-satisfiability formulae through the
cavity method. It is known that, for an interval of the clause-to-variables
ratio, this decomposes into an exponential number of pure states (clusters). We
refine substantially this picture by: (i) determining the precise location of
the clustering transition; (ii) uncovering a second `condensation' phase
transition in the structure of the solution set for k larger or equal than 4.
These results both follow from computing the large deviation rate of the
internal entropy of pure states. From a technical point of view our main
contributions are a simplified version of the cavity formalism for special
values of the Parisi replica symmetry breaking parameter m (in particular for
m=1 via a correspondence with the tree reconstruction problem) and new large-k
expansions.Comment: 30 pages, 14 figures, typos corrected, discussion of appendix C
expanded with a new figur